Ranking paths in stochastic time-dependent networks
نویسندگان
چکیده
منابع مشابه
K shortest paths in stochastic time-dependent networks
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns succes...
متن کاملBicriterion shortest paths in stochastic time-dependent networks
In recent years there has been a growing interest in using stochastic time-dependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path, but rather to a time-adaptive strategy. In some applications, however, it makes good sense to require ...
متن کاملMinimum weight paths in time-dependent networks
We investigate the minimum weight path problem in networks whose link weights and link delays are both functions of time. We demonstrate that in general there exist cases in which no finite path is optimal leading us to define an infinite path (naturally, containing loops) in such a way that the minimum weight problem always has a solution. We also characterize the structure of an infinite opti...
متن کاملShortest Paths in Stochastic Time-dependent Networks with Link Travel Time Correlation
This paper develops a simple robust framework for the problem of finding the least expected travel time route from any node to any given destination in a stochastic and time-dependent network. We consider both spatial and temporal link travel time correlations in the proposed solution based on a dynamic programming approach. In particular, the spatial correlation is represented by a Markovian p...
متن کاملLeast Expected Time Paths in Stochastic, Time-Varying Transportation Networks
We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2014
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.10.022